LR-Parsing Derived
نویسنده
چکیده
The LR(k)-parsing algorithm is derived, i.e., presented and proved as an interplay between program development and parsing theory. The program development uses invariants and the new concept of weakest angelic precondition. The parsing theory involved relates rightmost derivability to three other transitive relations on strings. The usual stack of item sets and the finite automaton appear in an optimisation of the abstract algorithm.
منابع مشابه
A New Approach to the Construction of Generalized LR Parsing Algorithms
LR parsing strategies can analyze LR grammars, which are deterministic. If we consider LR parsing tables in which each entry can contain several actions, we obtain non-deterministic LR parsing, often known as generalized LR parsing, which can analyze non-deterministic context-free grammars. It this context, some mechanism is needed in order to represent the non-deterministic evolution of the st...
متن کاملIntegration of morphological and syntactic analysis based on LR parsing algorithm
Morphological analysis of Japanese is very different from that of English, because no spaces are placed between words. The analysis includes segmentation of words. However, ambiguities in segmentation is not always resolved only with morphological information. This paper proposes a method to integrate the morphological and syntactic analysis based on LR parsing algorithm. An LR table derived fr...
متن کاملConstruction of Eecient Generalized Lr Parsers
We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing algorithm. The result is a Generalized LR parsing algorithm working at complexity O(n 3) in the worst case, which is achieved by the use of dynamic programming to represent the non-deterministic evolution of the stack instead of graph-structured stack representations, as has...
متن کاملAn Alternative LR Algorithm for TAGs
We present a new LR algorithm for treeadjoining grammars. It is an alternative to an existing algorithm that is shown to be incorrect. Furthermore, the new algorithm is much simpler, being very close to traditional LR parsing for context-free grammars. The construction of derived trees and the computation of features also become straightforward. 1 I n t r o d u c t i o n The efficiency of LR(k)...
متن کاملConstruction of Efficient Generalized LR Parsers
We show how LR parsers for the analysis of arbitrary contextfree grammars can be derived from classical Earley’s parsing algorithm. The result is a Generalized LR parsing algorithm working at complexity O(n) in the worst case, which is achieved by the use of dynamic programming to represent the non-deterministic evolution of the stack instead of graph-structured stack representations, as has of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Sci. Comput. Program.
دوره 19 شماره
صفحات -
تاریخ انتشار 1992